Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks

In this article, the routing in massive low earth orbit (LEO) satellite networks is studied. When satellite-to-satellite communication distance limited, we choose different relay satellites to minimize latency a constellation at constant altitude. First, global optimum solution obtained ideal scenario when there are available all locations. Next, propose nearest neighbor search algorithm for realistic (nonideal) scenarios with limited number of satellites. The proposed can approach under an through finite iterations and tiny range searches. Compared other strategies, shows significant advantages terms latency. Furthermore, provide two approximation techniques that give tight lower upper bounds algorithm, respectively. Finally, relationships between height, satellites' number, investigated.